Subtyping in Logical Form
نویسنده
چکیده
By using intersection types and filter models we formulate a theory of types for a λ-calculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the language of properties (the intersection types) which describes the underlying type free realizability structure. We show that such an interpretation is a PER semantics, proving that the quotient space arising from “logical” PERs taken with the intrinsic ordering is isomorphic to the filter semantics of types.
منابع مشابه
Products and Polymorphic Subtypes
This paper is devoted to a comprehensive study of polymorphic subtypes with products. We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of !; type constructors and the 8 quantifier, and we show that such axiomatization is not encodable in the system with !;8 only. In order to give a logical semantics to such a subtyping relation, w...
متن کاملCoercive Subtyping
We propose and study coercive subtyping, a formal extension with subtyping of dependent type theories such as Martin-LL of's type theory 38] and the type theory UTT 30]. In this approach, subtyping with speciied implicit coercions is treated as a feature at the level of the logical framework; in particular, the meaning of an object being in a supertype is given by coercive deenition rules for t...
متن کامل1 Conclusion and Future Work Conversion-based Rules Observe That Rules S-apr, S-apsl and S-apsr Con- S-apt
J. Tiuryn. A sequent calculus for subtyping polymorphic types. unpublished , 1996. TU96] J. Tiuryn and P. Urzyczyn. The subtyping problem for second-order types is undecidable. In this short survey, we have presented subtyping for two type systems: Cò for System-F(c) and P ; for. There are several common features in these studies. From the syntactic point of view, both in Cò and transitivity is...
متن کاملCoercive Subtyping in Type Theory
We propose and study coercive subtyping, a formal extension with subtyping of dependent type theories such as Martin-LL of's type theory NPS90] and the type theory UTT Luo94]. In this approach, subtyping with speciied implicit coercions is treated as a feature at the level of the logical framework; in particular, subsumption and coercion are combined in such a way that the meaning of an object ...
متن کاملSubtyping dependent types
The need for subtyping in type-systems with dependent types has been realized for some years. But it is hard to prove that systems combining the two features have fundamental properties such as subject reduction. Here we investigate a subtyping extension of the system λP, which is an abstract version of the type system of the Edinburgh Logicalversion of the type system of the Edinburgh Logical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 70 شماره
صفحات -
تاریخ انتشار 2002